Caterpillar dualities and regular languages
نویسندگان
چکیده
We characterize obstruction sets in caterpillar dualities in terms of regular languages, and give a construction of the dual of a regular family of caterpillars. In particular, we prove that every monadic linear Datalog program with at most one EDB per rule defines the complement of a contraint satisfaction problem.
منابع مشابه
Regular families of forests, antichains and duality pairs of relational structures
Homomorphism duality pairs play a crucial role in the theory of relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both side are infinite seems to be very complex. It is also known that no finite-infinite duality pair is possible if we make the additional restriction that both classes are antichains. In ...
متن کاملCaterpillars: A Context Specification Technique
We present a novel, yet simple, technique for the speciication of context in structured documents that we call caterpillar expressions. Although we are primarily applying this technique in the speciication of context-dependent style sheets for HTML, SGML and XML documents, it can also be used for query speciica-tion for structured documents, as we shall demonstrate, and for the speciication of ...
متن کاملOne-Visit Caterpillar Tree Automata
We study caterpillar tree automata [3] that are restricted to enter any subtree at most one time (or k times). We show that, somewhat surprisingly, the deterministic one-visit automata can already, for instance, evaluate trees where the nodes represent some non-associative operations. We show that there exist regular tree languages that cannot be accepted by a one-visit automaton, thus proving ...
متن کاملUniversal Structures with Forbidden Homomorphisms
We relate the existence problem of universal objects to the properties of corresponding enriched categories (lifts or expansions). In particular, extending earlier results, we prove that for every regular set F of finite connected structures there exists a (countable) ω-categorical universal structure U for the class Forbh(F) (of all countable structures not containing any homomorphic image of ...
متن کاملBalanced Context-Free Grammars, Hedge Grammars and Pushdown Caterpillar Automata
The XML community generally takes trees and hedges as the model for XML document instances and element content. In contrast, Berstel and Boasson have discussed XML documents in the framework of extended context-free grammar, modeling XML documents as Dyck strings and schemas as balanced grammars. How can these two models be brought closer together? We examine the close relatioship between Dyck ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 27 شماره
صفحات -
تاریخ انتشار 2013